منابع مشابه
NpgRJ_NN_1611 28..30
To examine mirror neuron abnormalities in autism, highfunctioning children with autism and matched controls underwent fMRI while imitating and observing emotional expressions. Although both groups performed the tasks equally well, children with autism showed no mirror neuron activity in the inferior frontal gyrus (pars opercularis). Notably, activity in this area was inversely related to sympto...
متن کاملExplanation of 29 SiO , 30 SiO and high - v 28 SiO maser emission
We have developed a non–local radiative transfer code to study the effects of line overlaps between different molecular species on the emergent line intensities from interstellar and circumstellar clouds. The numerical method solves the transfer of radiation and the statistical equilibrium populations for the different molecules simultaneously, and allows a direct comparison between the intensi...
متن کاملUnsupervised Texture Segmentation 31 30
615 rue de Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, IRISA, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 46 avenue Félix Viallet, 38031 GRENOBLE Cedex 1 Unité de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unité de recherche INRIA Sophia-Antipolis, 2004 rout...
متن کامل31 30 4 Experimental Results
The general problem of unsupervised textured image segmentation remains a fundamental but not entirely solved issue in image analysis. Many studies have proven that statistical model-based texture segmentation algorithms yield good results provided that the model parameters and the number of regions be known a priori. In this paper, we present an unsupervised texture segmentation method which d...
متن کاملCsci 3104, Cu-boulder Lectures 29 – 31
Suppose we have a set of items V along with a set of allowed pairings of items E : V × V , which defines a graph G = (V,E). A matching on this graph is a subset of edges E′ ⊆ E such that each vertex in V participates in at most one edge in E′. Call V ′ the set of vertices that participate in some edge e ∈ E′, and let M = (V ′, E′) denote a matching. Depending on additional requirements, we may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ghendtsche Tydinghen
سال: 1970
ISSN: 1783-9033
DOI: 10.21825/gt.v27i2.6350